An Automated Multilevel Substructuring Method for Eigenspace Computation in Linear Elastodynamics
نویسندگان
چکیده
Abstract. We present an automated multilevel substructuring (AMLS) method for eigenvalue computations in linear elastodynamics in a variational and algebraic setting. AMLS first recursively partitions the domain of the PDE into a hierarchy of subdomains. Then AMLS recursively generates a subspace for approximating the eigenvectors associated with the smallest eigenvalues by computing partial eigensolutions associated with the subdomains and the interfaces between them. We remark that although we present AMLS for linear elastodynamics, our formulation is abstract and applies to generic H-elliptic bilinear forms. In the variational formulation, we define an interface mass operator that is consistent with the treatment of elastic properties by the familiar Steklov-Poincaré operator. With this interface mass operator, all of the subdomain and interface eigenvalue problems in AMLS become orthogonal projections of the global eigenvalue problem onto a hierarchy of subspaces. Convergence of AMLS is determined in the continuous setting by the truncation of these eigenspaces, independent of other discretization schemes. The goal of AMLS, in the algebraic setting, is to achieve a high level of dimensional reduction, locally and inexpensively, while balancing the errors associated with truncation and the finite element discretization. This is accomplished by matching the mesh-independent AMLS truncation error with the finite element discretization error. Our report ends with numerical experiments that demonstrate the effectiveness of AMLS on a model and an industrial problem.
منابع مشابه
Hierarchical Substructuring Combined with Svd-based Model Reduction Methods
The direct applicability of SVD-based methods in model reduction of large linear systems is very limited. However, substructuring methods are a possibility to use these approaches. A method called Automated Multilevel Substructuring (AMLS) has been successfully applied to eigenvalue computations of very large systems. We present a similar substructuring approach for linear time-invariant (LTI) ...
متن کاملAn A Priori Bound for Automated Multilevel Substructuring
Abstract. The Automated Multi-Level Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and has recently been proposed as an alternative to iterative projection methods like Lanczos or Jacobi–Davidson for computing a large number of eigenvalues for matrices of very large dimension. Based on Schur complements and modal approximations...
متن کاملAutomated Multi-Level Substructuring for nonlinear eigenproblems
In this paper we generalize the automated multi–level substructuring method to certain classes of nonlinear eigenvalue problems which can be partitioned into an essential linear and positive definite pencil and a small residual. The efficiency of the method is demonstrated by numerical examples modeling damped vibrations of a structure with nonproportional damping, a gyroscopic eigenproblem, an...
متن کاملOptimizing Noise and Vibration Performance Using Automated Multi-level Substructuring
The most costly part of the eeort for optimizing noise and vibration performance in automobiles is the computation of frequency response for very large nite element models. Until very recently, this task has only been feasible on vector supercomputers. The Automated Multi-Level Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and...
متن کاملSubstructuring Preconditioning for Finite Element Approximations of Second Order Elliptic Problems. Ii. Mixed Method for an Elliptic Operator with Scalar Tensor
Abstract This work continues the series of papers in which new approach of constructing alge braic multilevel preconditioners for mixed nite element methods for second order elliptic problems with tensor coe cients on general grid is proposed The linear system arising from the mixed meth ods is rst algebraically condensed to a symmetric positive de nite system for Lagrange multipliers which cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 25 شماره
صفحات -
تاریخ انتشار 2004